perm filename SEPTEM.MSG[ESS,JMC] blob
sn#123704 filedate 1974-10-01 generic text, type T, neo UTF8
∂01-OCT-74 0501 105,SGK AT TTY40 0501
How much does the NYT cost you a year? Is it mailed to you?
How late does it come?
∂01-OCT-74 1301 1,QIB
Prof. Feldman called today and is planning on coming to the Lab to work with
his Students, etc., he would like to come either the 13th or 20th of November,
do you have a preference - let me know. Thank you - Queenie
∂29-SEP-74 1228 network site CMU
***** FTP mail from [X180LE03] (SIGART)
To: John McCarthy@SU-AI
From: Lee Erman (SIGART@CMU-10B)
Date: 29-Sep-74
Re: Letter for SIGART Newsletter
We (Jack Buchanan and I) have a copy of a letter to you from
Zohar Manna re his obtaining a visa to Russia for IJCAI4. We
assume that it has been submitted to appear in the SIGART
Newsletter, but wanted to make sure that was the case.
We will wait for an OKAY from you before printing it.
Thanks,
Lee
∂27-SEP-74 1410 H,RF
Minor changes to PAL routines:
1) BES's floating I/O is now in HALIO.
2) FLOAT is an assembly flag for floating routines
3) Assembly flags go in HALHED.PAL
4) There is a location called LINBUF which has room for
84 characters of input, for use as an input buffer. May
eventually become a system line buffer cum editor.
␈ CC: @HAL:RCB,RF,LOU,RHT,[HAL,HE],JMC,JH,BO,BES
∂27-SEP-74 1324 1,KNM
john--in regard to the symposium titles, many snags and not much info.
1. Jan Norbye is in Europe until Oct.10 and no one in his office knew
of a title for his presentation.
2. Joseph Coates was also out of town, but I left word for him to call
when he returns Monday.
3. Ernest Starkman has been waiting to hear from you on what precisely
you wanted him to speak on. I told him to go ahead and work out a
tentative or working title and call us on Monday.
4. Frank Grad was waiting for you to confirm the dates of the symposium
but will call me sometime Monday with something for a title
5. Eric Stork forgot about the thing, has no communication from you as
to what he is suppose to speak on and no idea as to what the session
is about. He wanted you to call him at the Dulles airport as he is
en route to Paris. I shall call and read him blurb.car and tell
him the other participants in his session. If he cannot think of
a title, he said to make one up.
6. Need you title too.
7. Norbye can be reach Oct. 3-9 at Hotel Royal Monceax, 35-39 Avenue Hoche,
75008 Paris, France, but I figure that will be too late.
∂27-SEP-74 0531 P,JRA
Would you consider asking for volunteers in cs206 to read my latest
LISP notes? Reaction from the cognoscenti has been quite favorable, but
I'd like to see how the approach fares with beginning students.
∂26-SEP-74 1255 P,JRA
question: B. Liskov ≡ B. Huberman
∂25-SEP-74 1021 1,KNM
Commentary magazine has only a home address for Lev Navrozov and it is listed
as confidential not to be give out. She didn't have a phone listed. She said
that you could write to him c/o the magazine.
Barbara huberman's thesis is no longer available here at the lab. It can be
ordered for $3.50 from NTIS--do you want to buy it?
∂24-SEP-74 1102 1,BPM
Do you know anything about Philosophy 16/116: Philosophical Problems in
Machine Intelligence? It's taught Winter Quarter by Prof. Smith of
Philosophy.
∂24-SEP-74 1053 1,KNM
CALL BOB FLOYD--11:00 24 SEPT
∂24-SEP-74 0948 1,KNM
ACADEMIC COUNCIL MEETING WILL BE HELD IN 204 POLYA
∂24-SEP-74 0931 1,KNM
BETTE SCOTT CALLED AGAIN AND BOB FILMAN HAS AN INCOMPLETE IN CS 293 (SPRING 74)
WHICH MEANS HE WOULD NOT BE ELIGIBLE FOR A DEGREE. SHE NEEDS TO KNOW WHETHER
OR NOT THE INCOMPLETE WAS MADE UP AND IF SO THE GRADE BEFORE THE MEETING TODAY
AT 2-KASEE
∂24-SEP-74 0731 network site ISI
Date: 24 SEP 1974 0733-PDT
From: FIELDS at USC-ISI
Subject: new program in advanced memory systems
To: feigenbaum, weiner at RAND-RCC, tach, jmc at SU-AI,
To: elkind at PARC, newell at CMU-10A, pirtle at I4-TENEX,
To: stockham at UTAH, sutherland at BBN, uncapher, holt at BBN,
To: Dertouzos.MAC at MIT-MULTICS, mm at MIT-AI
cc: LICKLIDER
Gentlemen:
Malcolm Currie, DDR&E, will soon send ARPA a memo,
a preliminary draft of which appears below, requesting that
ARPA plan a program in advanced memory systems. In order
to do this we wish to organize a planning committee to meet
during October and November. The committee should
recommend a program design, including near and long term
goals, potential milestones and decision dates,
potential bottlenecks, required resources, and so on...
Members of the committee should be especially
creative and representative a number of diverse
disciplines that could possibly contribute to
advanced memory technology. We are writing to
request that you suggest possible members for the committee.
It would be helpful if your suggestions included
a little information about the person and how he (or she)
may be contacted (address, net address, telephone,etc.).
Although we will not consider the membership
frozen at any time, the committee should begin
quite soon. Hence, a speedy reply would be helpful.
Both Lick and I should be sent copies of your
suggestions.
Thank you,
Very truly yours,
Craig Fields
MEMORANDUM FOR DIRECTOR,DEFENSE ADVANCED RESEARCH
PROJECTS AGENCY
SUBJECT: Program Plan for Advanced Computer Memory Technology
I have recently reviewed the status of current U.S. computer memory
development and the potential long-range DoD need for more advanced
computer memories. It appears that commercial developers will continue
to extrapolate conventional memory technology to meet near-term DoD
needs. However, there are areas of need looming on the horizon in the
mid-1980's and beyond which will not be satisfied by these extrapolations.
At the same time, there appears to be several new concepts which
could be pursed to achieve a quantum leap forward
in mass memory technology. Furthermore, there is an historical
perspective on computer growth and utility which closely relates
such progress to memory technology advances. Therefore, it is my conviction that DoD should take the lead in exploring high risk
technological opportunities for developing radically new memory media and
techniques.
I am, there, requesting ARPA to prepare a DoD program plan of research into fundamental concepts underlying advanced computer memories and into phenomena and techniques that will provide
new bases for memories in the 1985-90 time period. The program should
stimulate exploration of new memory media and methods and should provide a motivating and organizing focus for fundamental work
in pertinent areas of physics, chemistry and engineering, as well as
computer science.
It is important to attack this problem in a multi-disciplinary
manner because revolutionary rather than evolutionary approaches
will be necessary to achieve the quantum jump in capability required.
Some DoD applications which will certainly challenge physical capa-
bilities in the mid-1980's are intelligence information processing,
physical process and system simulations, and large time-sharing com-
mand, control and communication problems. These and other applications
may require random access memories with greater than 10**10 bits
total storage with bit densities greater than 10**7 bits/cm2.
Planning for the required technology program should begin with a
thorough analysis of national security needs for memory systems in the
coming decades, but the program plan should not be limited by a mere
extrapolation of present applications or technologies. The potentials
of molecular, crystal, organic, and even biological memories should be investigted. However, new departures and long extrapolations in
solid-state, magnetic, electron-beam, laser and other "conventional" memory media should not be ignored. Very dense memories of medium size
should be held as goals in addition to very large memories. Software
and broad systems aspects of memory technology should be explored along
with potential hardware technologies.
The plan should be formulated in terms of initial major objectives and
fiscal projections and should be submitted to me by December 1, 1974.
Malcolm R. Currie
-------
∂22-SEP-74 1224 FOO,DBA
I have been reading your technology essays: comments on JMCTEK.COM[FOO,DBA]
∂22-SEP-74 0611 BBB,BBM
Here is a list of files which contain the parser in its present
state:
PARSER.SAI (.DMP exists on [BBB,BBM]) is the parse table interpreter;
HALEX.SAI, EXHAL.SAI and .REL,PRODEC.SAI contain the exec routines
needed by PARSER;
PTRANS.SAI (.DMP exists on [BBB,BBM] is the program that translates
PL productions into tables for use by the parser;
PTRANS produces TABLE.SAI,EXEC.SAI,LAB.SAI on whatever area it is
working.
All the above programs use the same scanner module: INIT.SAI[CSP,SYS];
load modules on [1,3] (IOREL.REL,SEAR.REL,NOSEAR.REL,HASH.REL).
I am leaving tomorrow - today, that is. It has been very enjoyable
for me to work here; I wish you the best of everything, and I hope
I'll see some of you in Paris (or elsewhere) soon. So long
Bertrand
∂20-SEP-74 1332 1,DEW
John, I called your house but couldn't find you. I'm heading home since
some long lost friends from Essex and other places have showed up.
I want to talk so either I'll catch you Monday or you can call me at home.
Dave
∂20-SEP-74 0923 D,LOU
There will be a Hal meeting today Friday at 2pm in Lou's office.
Agenda items include: schedule of regular meetings, current state of
work, Jerry's comments of the document.
Lou.
∂20-SEP-74 0914 001,MJH
John--When I sent my thesis in to Graduate Studies, I included a couple
of extra originals to be bound. This morning, I "autographed" one of
these bound originals and put it in your office on the chair by your
terminal. Jo
∂19-SEP-74 2331 NET,TVR
Re: Answer to SOFT
I have been developing a subroutine library which i use in many of my FAIL
programs. It is described in part by TVRLIB.DOC[1,TVR]. However, i'm not
ready to guarantee that all the bugs have been shaked out of it yet.
Tovar
∂19-SEP-74 2240 1,JBR
∂19-SEP-74 0759 100,100 AT TTY121 : SUTKOWSKI @ network site RADT
PLEASE, I BEG OF YOU, LET GUEST USERS KNOW WHAT IS HAPPENING ON
THE SYSTEM AND THE CHANCES OF THE GUEST ACCOUNT BEING RESTORED.
ALL WE WANT IS AN EVEN BREAK. THANK YYU.
∂19-SEP-74 1451 1,AC network site UKT
LEE AND ELSA HOROWTIZ ASKED ME TO GIVE YOU THERE
BEST WISHES. (THEY WERE PASSING THROUGH LONDON RECENTLY
AND I SAID I WOU;D FORWARD THEIR GREETING NEXT TIME I WAS ON YOUR MACHINE.)
YOURS
ALAN CAMPBELL
∂18-SEP-74 2028 NET,TVR
I thought about the FIND problem briefly and have the following observations
1. FIND is not always used to search for the main key. For example, i have
used it to find out who lives in Berkeley. It would not be much problem
to make FIND do a radix search, however it would only work for the main
key.
2. FIND could look at the first line of the file to decide how to print it.
For example: MSG files always begin with '∂'; TVED/E files begin with a
'COMMENT ⊗' and usually contain paragraphed text, although one may want
to ignore directorys altogether. One could also invent a format state-
ment which could be interpeted as a comment by other processors, such as
PUB or FAIL, which would tell FIND what a unit consists of, what are the
delimiters, and how to print it. For example, FIND could be used to find
all references to a particular symbol in a program.
3. One sometimes wants to search for more than one key, as one does in the
News Service. However, NS may already have a data structure created at
at the time it is started, the generation of which would be prohibitive-
ly expensive to generate other than incrementally.
4. It has been claimed that SOS and/or E is faster than the current FIND. I
have not run any test yet to verify this. However, i'm not an expert on
writing super-fast clever string searches. Yet, on the other hand, FW's
string searcher never got finished.
By the way, who wrote the current FIND and do you know where the source for
it is?
Tovar
∂18-SEP-74 1428 FOO,DBA
BPM on Cordell Green's group's software needs now in SOFT.ANS
∂18-SEP-74 0729 network site ISI
Date: 18 SEP 1974 0656-PDT
From: LICKLIDER at USC-ISI
Subject: Meeting with Draper
To: PHW at MIT-AI, JMC at SU-AI, Raphael at SRI-AI
cc: Fields, Licklider
Jim Nevins of the Draper Labs got me to promise him,
a long time ago, that I would set up something to evaluate
the contribution, if any, that Draper work on hands and arms
could make to ARPA-supported AI work in the visualmotor area.
First, do you have any interest. Second, if you do, would
yu designate a person to visit Draper at a time we would
agree on, between Oct. 10 and Nov. 1, if possible, as a
member of a 2 or 3 man team, which would develop
a conclusion about the usefulness to AI of the Draper stuff.
Third, if you do not, would you indicate why, wo i can make
a reasonable reply to Nevins.
Regards
Lick
-------
∂17-SEP-74 1505 FOO,DBA
I decided to cancel the discussion of "SOFT" which had been
tentatively set for Thursday. Nobody had any positive proposals to
discuss, and we already have a monthly meeting where people can talk
about computing facilities. However I think the exercise was
worthwhile: I will tidy up all the things that got written and tell
you where to find them.
Bruce Anderson
∂13-SEP-74 0919 SEC,TW
PLAN[1,tw] describes my research interests, primarily intended for
new students (and others) information. If you have any comments
I would appreciate them (I won't distribute it publically for
a few days yet).
∂14-SEP-74 1955 ACT,REG
In 1965, while I was still in high school, I visited an open house at MIT, where
ELIZA was being demonstrated. One of the things I recall is that I typed,
"MY NAME IS 37633" which caused it to crash. I am happy to report that DOC
still has this problem.
∂11-SEP-74 1647 2,JH
John,
Did you have in mind the standard tour for this EXXON official?
Movie, watch the arm do something, and a discuussion of our proposed work
on robot coal mining. What did you have in mind for a vision demonstration?
Perhaps we can persuade him to give the lab a small 5 figure gift!!
Jim
∂11-SEP-74 1644 1,BH
Lorraine Larson of Ma Bell is coming here to do a "communications
survey" following which they will tell us what kind of phone
service they think we want. She wants to talk to the "key people"
and heavy telephone users. We have agreed on 1pm Wednesday (9/18)
for an initial meeting. If any of you want to come and don't like
that time, or think someone else should come, or whatever, let me
know ASAP. Tnx.
␈ CC: les;jxj;jmc;qib;paw;knm
∂11-SEP-74 1514 R,WD
Deborah Hayflich just came by to bill youor the New Y∨rk Times.
The bill is $68.20 for June, July and August.
∂12-SEP-74 1045 FOO,DBA
How about 2pm Thursday next week (19th) for an open discussion of SOFT?
Please let me know if you want to come but that time is no good.
Bruce
∂12-SEP-74 1019 FOO,DBA
Terry Winograd's response to SOFT is now in SOFT.ANS[FOO,DBA]
∂10-SEP-74 2141 1,JBR
10-SEP-74 2021
from :100,100 AT TTY121:
ARPA PERSON WHO NEVER HAS MISUSED YOUR SYSTEM @ network site RTGT
PLEASE RECONSIDER..THIS WAS ONCE A VERY NICE SYSTEM. THERE ARE
MANY PEOPLE WHO WOULD JUST BROSE AROUND WITHOUT HURTING ANYTHING.
ALSO, YOU HAVE TECH2, WHICH MY PDP-10 SYSTEM CANNOT RUN BECAUSE OF
CORE RESTRICTIONS. I ONLY LOGGED ON OCCASIONALLY, LIKE ONCE EVERY
TWO WEEKS, BUT NOW, I CAN'T.
PLEASE, PLEASE RECONSIDER!!!
∂10-SEP-74 1313 NS,ME
To get, for example, story NYT40, use the expression #40/-AP/NY.
∂10-SEP-74 1055 4,KMC AT TTY31 1055
WE NEED HELP IN DEBUGGING PARRY. RATHER THAN ELIMINATE IT ENTIRELY, WE
COULD RESTRICT IT TO RUNNING ONLY ONE PARRY AT A TIME...KEN
∂10-SEP-74 0843 S,WD
When you made your comment on the Friedman and Hoffman paper in the
ACM on speed of enciphering, I forgot to tell you that I had done some
tests awhile back on our own programs. I can probably locate the
data, which are not at hand. Roughly speaking, my fastest bummed hand coded
version of Code took 1.3 seconds per K of test. The system versaion in
SAIL to three to five times as long and the double precision programs
ENCODE and DECODE took two or three times longer than that.
∂09-SEP-74 1907 ACT,REG
As a toy, PARRY has gotten out of hand. It take 69 disk ops to respond to
"How are you today?" and 45 disk ops or more for every response.
I has also grown to 68K. It is entirely too non-trivial to be allowed as
a game for random network types.
∂7-SEP-74 0938 network site BBN
Date: 7 SEP 1974 1239-EDT
From: LICKLIDER at BBN-TENEX
Subject: Request for Nominees to Advisory Committees
To: ABBOTT at ISI, BARAN at ISI, BASKIN at BBN, BERNSTEIN at BBN,
To: BRYAN at UCSB-MOD75, CHEATHAM at HARV-10, DICKSON at BBN,
To: ENGELBART at SRI-ARC, FEIGENBAUM at ISI, FRALICK at SRI-AI,
To: FRANK at ISI, Dertouzos.MAC at MIT-MULTICS, HEART at BBN,
To: HOLT at BBN, KIRSTEIN at USC-ISI, KLEINROCK at ISI,
To: KUO at ISI, LEBOW at BBN, MAGILL at SRI-AI, TOM at CCA,
To: JMC at SU-AI, MILLSTEIN at SRI-ARC, PHW at MIT-AI,
To: MITCHELL at PARC-MAXC, NEWELL at CMU-10A, NORTON at SRI-ARC,
To: OMALLEY at BBN, PIRTLE at I4-TENEX, PRATT at ISI,
To: RAPHAEL at SRI-AI, SHOUP at ISI, STOCKHAM at UTAH,
To: SUTHERLAND at BBN, UNCAPHER at ISI, VAN SLYKE at ISI,
To: WALKER at SRI-AI, WATSON at SRI-ARC
cc: Russell, Licklider
ARPA/IPTO is in the process of setting up advisory
committees for most of its programs that do not already have advisory
committees. Typically, an advisory committee will consist of three
or four representatives of the part of the national security world in
which the expected results of the program are likely to be
applied and three or four leaders of the field of science or tech-
nology in which the program is focused.
The purpose of this message is to request suggestions from you.
We would like to have names of individuals you think would be good
advisors. Please suggest people from either group mentioned or
others you think would be helpful. Please associate with each
nominee his affiliation and, if you think he may not be known to
IPTO, a sentence or two about him. An address and telephone
number would be good if you have them conveniently at hand. Please
associate with each nominee, also, of course, the program or
programs to which he would be appropriate.
By 'program' we mean a cluster of contracts with a common
goal or in a single R&D area. Artificial Intelligence (which includes
Intelligent Systems, Knowledge-Based Computer System Applications,
and probably Intelligent Terminals), Software Science and Technology
(which includes Automatic Programming, Software Production
Technology, and probably Very Large Data-Base Systems), Speech
Understanding Systems, Image Processing, Networks, Secure
Computer-Communication Systems (including Secure Computer Operating
Systems and End-to-End-Secure Digital Systems),
Image Processing, and Advanced Command-Control-
Communications are programs. The items in the parentheses are
what the jargon calls 'subprojects'.
By 'advisory committee' we mean about the same thing as
'steering committee'. Advisory committees will steer through
advice, but IPTO will pay a lot of attention to their advice.
Indeed, the advisory committees will be (as already in the case
of Speech Understanding Systems) very important parts of the program
management process.
An open question is whether the PIs of the contracts
in a program should or should not be members of the advisory
committee for the program. Our management tends to think not, but
in the case in which they have been things have worked well.
If you have suggestions about how advisory committees should
be constituted, set up, selected, or used, or about tenure or
rotation of membership, or any other pertinent topic,
IPTO will welcome them.
Thank you for help and cooperation.
Regards
Lick
(Licklider @ ISI or @ BBN
or @ Office-1)
P.S.: The presence of 'probably' twice in the association of
subprojects with programs indicates correctly that IPTO is
in the process of creating new subprojects and grouping
them into programs. But do not wait for us to finish the process!
Please send the nominations (I meant 'nominations', not 'nominees',
in the Subject) as soon as possible. Lick
-------
∂05-SEP-74 1336 PC,RWW
IT SEEMS TO ME THAT THE TYPE 1 PATTERNS THAT YOU DESCRIBE ARE EXACTLY THE
TYPE OF MATCH THAT IS MADE BY THE LCF SIMPLIFIER. THE UNIFY ROUTINE THAT
I
KEEP REFERRING TO WAS ASHOKS AND MY FIRST ATTEMPT AT DOING THAT FOR FIRST
ORDER LOGIC. THIS "UNIFICATION" TOGATHER WITH SEMANTIC ATTACHMENT SHOULD
DO YOUR COMPUTATION ON THESE PREDICATES. THE "UNIFICATION" THAT ASHOK AND
I WROTE IS SUPPOSED TO BE THE BASIC PATTERN MATCHER OF FOL. IT IS NOT A
THEOREM PROVING TOOL BUT A MATCHING PROCEEDURE WHICH ATTEMPTS MATCHES THAT
ARE MORE INCLUSIVE THAN TYPE1 MATCHES (TRIVIALLY IT HANDLES ∃ QUANT).
COMBINED WITH OUR NOTION (PERVERSLY) CALLED RESOLVE IT IS A VERY SOPHISTICATED
PATTERN MATCHER. (BY THE WAY IF GIVEN CLAUSES RESOLVE DOES RESOLUTIONS AND
GIVEN LITERALS UNIFY DOES UNIFICATIONS.) ANYWAY ENOUGH. I BELIEVE THAT
PATTERN MATCHING IN THE SENSE YOU DESCRIBED IS ESSENTIAL TO GETTING MACHINES TO
ACTUALLY REPRESENT PROOFS.
∂05-SEP-74 1225 P,JRA
I am soliciting comments, complaints, and criticisms on version N of
my LISP notes.
∂05-SEP-74 1227 100,100 AT TTY122 1227: JACK BUCHANAN @ network site CMUA
DEAR JOHN,
SO THAT WE MAY PLAN FOR YOUR VISIT TO CMU NEXT THURSDAY (SEPT. 12) WE WOULD
LIKE TO KNOW YOUR TIME OF ARRIVAL AND AVAILABLE TIME $ TO SEE PEOPLE
HERE.
REGARDS, JACK BUCHANAN
∂04-SEP-74 1342 1,QIB
I've left some chess positions and accompanying descriptive patterns on
your desk. Would like helpful comments. Dave Wilkins
∂4-SEP-74 1124 network site ISI
Date: 4 SEP 1974 1123-PDT
From: LICKLIDER at USC-ISI
Subject: Bajcsy
To: JMC at SU-AI, McCarthy at SU-AI
cc: Licklider
Talked with Mr. William O'Brien of Detention and Deportation ,
Immigration and Naturalization Service. Was directed to him by
Mr. Robert Lindsey, Assoc. Commissioner for Travel Control. as
directed to him by Dr. Carliner of Carliner and Gordon, representing
Bajcsy. Explained to O'Brien how expensive and valuable a person
trained in Intelligent Computer Systems is, and that it would take
compelling reasons, in my judgment, to deport such a person.
O'Brien seemed sympathetic and said he would talk with Mr. Augustine,
Dist. Dir of I & N Service, Phila., and let me know how it
came out.
Regards
Lick
-------
∂04-SEP-74 1040 1,JBR
∂04-SEP-74 0820 100,100 AT TTY121 : FRIAR TUCK(JOHN ATA FROM ROME,NY) @ network site RADT
YOUR RECENT CLOSING OF THE GUEST ACCOUNT IS DEPLORED BY MANY
GUEST USERS,INCLUDING MYSELF,BECAUSE OF ITS UNFAIRNESS
TO GUEST USERS WHO HAVE A LEGITIMATE PURPOSE
ON THE SYSTEM.NOW,I ADMIT,WE USED THE SYSTEM FOR TALK
PUPOSES TO AN EXCESS,HOWEVER THIS SHOULD NOT
HAVE RESULTED IN THE REMOVAL OF THE GUEST ACCOUNT.THERE
ARE MANY REASONS FOR THIS.
1.THE TALK RING DOES NOT USE UP CPU TIME,AND IT ONLY
HAS TO TAKE UP ONE JOB SLOT(IF USER IS NOT LOGGED IN.).
THERE SHOULD NOT HAVE BEEN A STRAIN ON THE SYSTEM EXCEPT
DURING THE AFTERNOON WHEN THE SYSTEM WAS HEAVILY LOADED.
WHEN THIS WAS THE CASE,THE COMPUTER PRINTED OUT A
MESSAGE TELLING THE PERSON THE STATUS OF THE SYSTEM.
IF AN ABUSE OR ABUSES WERE MADE,THEY PROBABLY OCCURED
FROM OTHER ACCOUNTS ALSO.
2.A COMMENT WAS MADE ON THE LANGUAGE THAT WAS USED.FIRST OF
ALL IF THE LANGUAGES IS OFFENSIVE TO YOU GUYS,WHY BOTHER TO
LISTEN IN?YOUR HAVING AS MUCH FUN AS ANY GUEST USER
HAS,ONLY YOU DONT HAVE THE THREAT OF PROJECT CUTOFF
OVER YOUR HEADS.IN FACT "ME" ADMITTED THAT
YOU GUYS MONITOR US BECAUSE IT "WAS FUN".NOONE IS
MAKING YOU LISTEN IN.ALSO,IF A GUEST USER SWORE AT YOU
WHEN YOU TOLD HIM TO GET OFF THE SYSTEM,SO WHAT!CAN T YOU
GUYS TAKE ANY KIDDING AROUND?IM SURE THAT PEOPLE AT
STANFOR WERE REALLY HURT AND SHOCKED AT THE LANGUAGE..
YOU ARENT KIDDING ANYBODY.
3.ON ANY SYSTEM,HECLERS AND MALICOUS INTENTS ARE TO EXPECTED.WHY HAVENT HARVARD AND ALL THE OTHER COMPUTER
SYSTEMS SHUT DOWN THEIR GUEST ACCOUNTS..(MULTICS HAS
A LARGER SYSTEM THAN YOU DO WITH MORE PROBABILITY OF
HECKLING,ETC).
4.WITHOUT THE GUEST ACCOUNT,YOU COULD DEPRIVE SOMEONE OF
THE CHANCE TO LEARN SOMETHING ON ONE OF THE MORE BETTER SYSTEMS.
5.P.S. REMEMBER THE PROGRAM LIMRIK?)
6. IN CLOSING ALL I CAN REPEAT IS THAT YOU HAVE DONE
A LOT OF PEOP;E INJUSTICE BY DELETING THAT GUEST ACCOUNT.
AND ALL BECAUSE YOU GUYS COULDNT TAKE A LITTLE HECKLING OR
A JOKE.
7.AND FIND OUT USES THE PROJECT 100,100..HE
HAS BEEN THE BIGGEST HECKLER OF ALL!HE CALLS←←←DISREGARD STATEMENT 7.
8.HECKLING IS WHEN GUYS HAVE DONE A LITTLE BIT OF SERIOUS WORK
AND NOW ARE DOING SOMETHING NOT SO SERIOUS...AND YOU GUYS ARE
NOT LOADED ALL DAY...I KNOW BECUSE I LOGGED IN ONCE,WITH ONLY
8 PEOPLE ON THE SYSTEM.
9.I WILL NOT BE LOGGING IN AT STANFORD ANYMORE...I NO LONGER
WORK WITH DEC PDP-10S HOWEVER,I HAVE TO SAY THAT OF ALL
THE MAJOR COMPUTORSYSTEMS I HAVE USED,AND WE HECLED ON
ALL OF THEM THE SAME WAY WE USED YOUR SYSTEM,YOU RESPONDED
WITHE THE LEAST BIT OF TOLERANCE,AND BY NOW MEANS ARE YOU THE MOST
HEAVILY LOADED SYSTEM ON THE ARPA NETWORK.SO GOODBYE,ITS TOO BAD
SOMEONE ELSE CANT ENJOY USING COMPUTORS ONCE IN A WHILE.
(END)
∂02-SEP-74 1109 FOO,DBA
I sent my previous note to everyone who gets this one. The distribution
list is SOFT.DIS and I will collect replies into SOFT.ANS. Let me know
if you think someone should be added to the distribution list.
Bruce
␈ CC: @SOFT.DIS:JMC,LES,TOB,CCG,RWW,TW,JH,DAV,HJE,TVR,JRA,REG,JBR,BH,RHT,DBL,MOORE%MAXC,DBA%SU-AI
∂01-SEP-74 2106 FOO,DBA
The file SOFT[FOO,DBA] is a memo of a few pages entitled "Software
goals at/for Stanford AI Lab". In it I put forward the opinion that
(to quote)
"... the quality of software ... and of the art of
programming, are in a poor state at the project."
It is intended to be relevant to current plans to expend a good deal
of resources on writing a new monitor. I would be very glad of your
reactions/comments/opinions to/on/of it. Scribble on a copy (you may
find a copy in your mailbox), or edit the file with E and put
(signed!) comments between <crlf>// and <crlf>.
Bruce Anderson